Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
نویسندگان
چکیده
منابع مشابه
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
A key factor that can dramatically reduce the search space during constraint solving is the criterion under which the variable to be instantiated next is selected. For this purpose numerous heuristics have been proposed. Some of the best of such heuristics exploit information about failures gathered throughout search and recorded in the form of constraint weights, while others measure the impor...
متن کاملDynamic Variable Ordering in CSPs
We investigate the dynamic variable ordering (DVO) technique commonly used in conjunction with tree-search algorithms for solving constraint satisfaction problems. We first provide an implementation methodology for adding DVO to an arbitrary tree-search algorithm. Our methodology is applicable to a wide range of algorithms including those that maintain complicated information about the search h...
متن کاملself-revision and third party revision in translation
اهمیت این پژوهش در آن بود که به گفت? بسیاری از پژوهشگرانِ حوز? بازبینی ترجمه، ادبیات موجود در این زمینه به لحاظ نظری و عملی چندان قوی نیست و بخش های موجود نیز برداشت مناسبی از این مرحل? فرایند ترجمه ندارند، اگرچه اخیراً توجه به آن به صورت نظام مند افزایش یافته است. در عین حال، پژوهش های موجود از یک سو بر دگربازبینی بیشتر از خودبازبینی تأکید دارند و از دیگر سو تنها به لحاظ نظری به این موضوع می پرد...
15 صفحه اولImproving Genet and Egenet by New Variable Ordering Strategies
Constraint satisfaction problems (CSPs) naturally occur in a number of important industrial applications such as planning and scheduling defeating many algorithmic search methods. GENET and it extended model, EGENET, are probabilistic neural networks which had some remarkable success in solving some hard instances of CSPs such as a set of hard graph coloring problems. Both GENET or EGENET does ...
متن کاملParticle Swarm in Binary CSPs with Dynamic Variable Ordering
The variable ordering of constraint satisfaction problems affect the performance of search algorithms in CSPs. Dynamic Variable Ordering (DVO) has more advantage in improving the performance of search algorithms than static variable ordering. It is a newly developed method recent years that using particle swarm algorithm to solve binary constraint satisfaction problems, which is a global stocha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2010
ISSN: 0169-2968
DOI: 10.3233/fi-2010-307